A coding theorem for abstract memoryless channels

A converse coding theorem for mismatched decoding at the output of binary-input memoryless channels

A coding theorem for the discrete memoryless broadcast channel

Coding and decoding for time-discrete amplitude-continuous memoryless channels

In this report we consider some aspects of the general problem of encoding and decoding for time-discrete, amplitude-continuous memoryless channels. The results can be summarized under three main headings. 1. Signal Space Structure: A scheme for constructing a discrete signal space, for which sequential encoding-decoding methods are possible for the general continuous memoryless channel, is des...

Adaptive joint H.263-channel coding for memoryless binary channels

The main purpose of this paper is to show that once the video source coding is dependent on the channel characteristics, better performance can be achieved in terms of reconstructed video quality. Our study considers a fixed overall bit rate transmission of 64 kbit/s over error prone memoryless binary channels and the source coder is the ITU-T H.263 video standard. The variable H.263 source cod...

Coding Theorem and Converse for Abstract Channels with Time Structure and Memory

A coding theorem and converse are proved for abstract channels with time structure that contain continuous-time continuous-valued channels and the result by Kadota and Wyner (1972) as special cases. As main contribution the coding theorem is proved for a significantly weaker condition on the channel output memory and without imposing extra measurability requirements to the channel. These improv...